The expressive power of first-order topological languages

نویسنده

  • Ernest Davis
چکیده

We consider the expressive power of the first-order structure 〈Ω, C〉 where Ω is either of two of different domains of extended regions in Euclidean space, and C(x,y) is the topological relation “Region x is in contact with region y.” We prove two main theorems: • Let P[Q] be the domain of bounded, non-empty, rational polyhedra in twoor threedimensional Euclidean space. A relation Γ over P[Q] is definable in the structure 〈P[Q], C〉 if and only if Γ is arithmetic and invariant under rational PL-homeomorphisms of the space to itself. We also extend this result to a number of other domains, including the domain of all polyhedra and the domain of semi-algebraic regions. • Let R be the space of bounded, non-empty, closed regular regions. in n-dimensional Euclidean space. Any analytical relation over lower-dimensional (i.e. empty interior) compact point sets that is invariant under homeomorphism is implicitly definable in the structure 〈R, C〉.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal languages for topology: Expressivity and definability

In this paper we study the expressive power and definability for (extended) modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt-Thomason definability theorem in terms of the well established first-order topological language Lt.

متن کامل

On Spiders Feet

Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority can only express statements involving unary relations and, sometimes, equality. Spider diagrams are one such language, being equivalent in expressive power to monadic first order logic with equality. Spiders are used to represent ...

متن کامل

On the Expressive Power of Graphical Query Languages

In this paper a comparison is presented between the expressive power of generic graphical mechanisms and the various classes of queries (first-order, fixpoint, programming). A precise evaluation of the expressive power of the languages based on such mechanisms (i.e.purely graphical query languages) is shown. Moreover, an informal analysis is provided relatively to the more general class of the ...

متن کامل

First order formulas with modular predicates

Two results by Schützenberger (1965) and by McNaughton and Papert (1971) lead to a precise description of the expressive power of first order logic on words interpreted as ordered colored structures. In this paper, we study the expressive power of existential formulas and of Boolean combinations of existential formulas in a logic enriched by modular numerical predicates. We first give a combina...

متن کامل

Enhancing the Expressiveness of Spider Diagram Systems

Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority are monadic and some include equality. Spider diagrams are one such language, being equivalent in expressive power to monadic first order logic with equality. Spiders are used to represent the existence of elements or specific ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Log. Comput.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2013